Computational Complexity of Linear Large Margin Classification With Ramp Loss Søren Frejstrup Maibing Department of Mathematical Sciences University of Copenhagen

Source URL: jmlr.org

Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models Dolores Romero Morales Department of Economics Copenhagen Business School April 27, 2015

Source URL: econ.medarbejdere.au.dk

An invitation to Linear Time or How to fit Computational Complexity to Algorithm Analysis? Etienne Grandjean GREYC, CNRS / University of Caen / ENSICAEN, France

Source URL: ptmat.fc.ul.pt

On the Computational Complexity of Naive-based Semantics for Abstract Dialectical Frameworks Sarah Alice Gaggl Computational Logic Group TU Dresden, Germany

Source URL: ddll.inf.tu-dresden.de

From Single to Double Use Expressions, with Applications to Parametric Interval Linear Systems: On Computational Complexity of Fuzzy and Interval Computations Joe Lorkowski Department of Computer Science

Source URL: www.cs.utep.edu

On the Computational Complexity of Deep Learning Shai Shalev-Shwartz School of CS and Engineering, The Hebrew University of Jerusalem ”Optimization and Statistical Learning”,

Source URL: lear.inrialpes.fr

Lecture 5: Introduction to Complexity TheoryComplexity Theory

Source URL: www.cs.rice.edu

• Applied mathematics
• P
• EXPTIME
• EXPSPACE
• L
• FO
• 2-EXPTIME
• Theoretical computer science
• Computational complexity theory
• Complexity classes

On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)

Source URL: www.cs.swan.ac.uk

• Complexity classes
• Proof theory
• Structural complexity theory
• Curry–Howard correspondence
• Type theory
• NP
• Time complexity
• Reduction
• Linear logic
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

On the Complexity of Differentially Private Data Release Efficient Algorithms and Hardness Results Cynthia Dwork ∗

Source URL: www.wisdom.weizmann.ac.il

• Applied probability
• Exponential mechanism
• Computational complexity theory
• Differential privacy
• Symbol
• Information theory
• Time complexity
• Net
• Data privacy
• Applied mathematics
• Mathematics

Compressive sensing using locality-preserving matrices Elyot Grant∗ Piotr Indyk∗ December 4, 2012

Source URL: people.csail.mit.edu

• Error detection and correction
• Information retrieval
• Artificial intelligence
• Computational complexity theory
• Universal hashing
• Lipschitz continuity
• Hash function
• Combinatory logic
• Tabulation hashing
• Search algorithms
• Hashing
• Theoretical computer science